Efficient Deduction in Many-Valued Logics
نویسنده
چکیده
This paper tries to identify the basic problems e.countered in automated theorem proving in many-valued logics and demonstrates to which extent they call be currently solved. To this end a .umber of recently developed techniques are reviewed. We list. tile avenues of research in manyvalued theorem proving that are in our eyes the most promising.
منابع مشابه
Sequent of Relations Calculi: A Framework for Analytic Deduction in Many-Valued Logics
We present a general framework that allows to construct systematically analytic calculi for a large family of (propositional) many-valued logics — called projective logics — characterized by a special format of their semantics. All finite-valued logics as well as infinite-valued Gödel logic are projective. As a case-study, sequent of relations calculi for Gödel logics are derived. A comparison ...
متن کاملSystematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and norm...
متن کاملSystematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and normal form theorems...
متن کاملLabelled Deduction over Algebras of Truth-Values
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelled natural deduction systems. The use of algebras of truth-values as the labelling algebras of our systems allows us to give generalized systems for multiple-valued logics. More specifically, our framework generalizes previous work where labels represent worlds in the underlying Kripke structure: ...
متن کاملTruth-values as Labels: A General Recipe for Labelled Deduction
We introduce a general recipe for presenting non-classical logics in a modular and uniform way as labelled deduction systems. Our recipe is based on a labelling mechanism where labels are general entities that are present, in one way or another, in all logics, namely truth-values. More specifically, the main idea underlying our approach is the use of algebras of truth-values, whose operators re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994